Algebraic Dynamic Programming over general data structures
نویسندگان
چکیده
منابع مشابه
Notes on Dynamic Programming Algorithms & Data Structures
The technique of Dynamic Programming (DP) could be described “recursion turned upside-down”. However, it is not usually used as an alternative to recursion. Rather, dynamic programming is used (if possible) for cases when a recurrence for an algorithmic problem will not run in polynomial-time if it is implemented recursively. So in fact Dynamic Programming is a morepowerful technique than basic...
متن کاملAlgebraic Dynamic Programming 2.0
Haskell has played a major role – and it still does – in the implementation of the Algebraic Dynamic Programming framework as it emerged about a decade ago. Here, we present a—yet unpublished— generalization of the ADP framework which also accomodates problems on trees. The new framework is not an “add-on” extension, but suggests a reformulation of “classical” ADP. ADP 2.0 is not only more gene...
متن کاملAlgebraic Dynamic Programming
Dynamic programming is a classic programming technique, applicable in a wide variety of domains, like stochastic systems analysis, operations research, combinatorics of discrete structures, flow problems, parsing with ambiguous grammars, or biosequence analysis. Yet, no methodology is available for designing such algorithms. The matrix recurrences that typically describe a dynamic programming a...
متن کاملADPfusion Efficient Dynamic Programming over Sequence Data
ADPfusion combines the usual high-level, terse notation of Haskell with an underlying fusion framework. The result is a parsing library that allows the user to write algorithms in a style very close to the notation used in formal languages and reap the performance benefits of automatic program fusion. Recent developments in natural language processing and computational biology have lead to a nu...
متن کاملIntrinsic computability over algebraic structures
The notion of computable function can be extended from the natural numbers to other domains, using an indexing. Usually, the choice of the indexing affects the set of computable functions and there is no intrinsic notion of computability over these domains. In this paper, we show that, in contrast, when we extend the notion of computable function to algebraic structures, we obtain an intrinsic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2015
ISSN: 1471-2105
DOI: 10.1186/1471-2105-16-s19-s2